Optimistic Parallel biscrete Relaxation
نویسندگان
چکیده
Discrete relaxation is frequently used to compute the fixed point of a discrete system where / is monotonic with respect to some partial order Given an appropriate init ial value for X, discrete relaxation repeats the assignment until a fixed point for / is found. Monotonicity of / with respect to is a sufficient (but in general not necessary) condition for iterative, hill-climbing techniques such as discrete relaxation to find the f ixed point of / .
منابع مشابه
Parallel Jobs Scheduling with a Specific Due Date: Asemi-definite Relaxation-based Algorithm
This paper considers a different version of the parallel machines scheduling problem in which the parallel jobs simultaneously requirea pre-specifiedjob-dependent number of machines when being processed.This relaxation departs from one of the classic scheduling assumptions. While the analytical conditions can be easily statedfor some simple models, a graph model approach is required when confli...
متن کاملSynchronous relaxation algorithm for parallel kinetic Monte Carlo simulations of thin film growth.
We present an optimistic synchronous relaxation algorithm for parallel kinetic Monte Carlo (KMC) simulations of thin film growth. This algorithm is based on spatial decomposition of the KMC lattice and it employs two measures aimed at improving the parallel efficiency: dynamic global updating and domain boundary shifting. We utilize this algorithm to simulate two different growth models, which ...
متن کاملRelaxation of Synchronization Constraints in Parallel Simulation of ATM Network
Parallel simulation using conservative or optimistic approach does not exhibit good performance when applied to large ATM networks. We introduce a statistically correct approach based on the observation that some performance measurements can be obtained without the total time ordering established by conventional approaches. In our approach events can be processed in partial time order. Upon rec...
متن کاملExperiences With Optimistic Synchronization For Distributed Operating Systems
Optimistic synchronization is a method of synchronizing parallel and distributed computations without the use of blocking. When non-optimistic systems would block, optimistic synchronization mechanisms permit operations to go ahead. If such optimism causes improper synchronization, the mis-synchronized work is undone and the entire system restored to a consistent state. This paper discusses the...
متن کاملA Case Study of Optimistic Computing on the Grid: Parallel Mesh Generation
This paper describes our progress in creating a case study on optimistic computing for the Grid using parallel mesh generation. For the implementation of both methods we will be using a Portable Runtime Environment for Mobile Applications (PREMA) which is extended to provide support for optimistic control using grid performance monitoring and prediction. Based on the observed performance of a w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993